Using spatio-temporal continuity constraints to enhance visual tracking of moving objects

We present a framework for annotating dynamic scenes involving occlusion and other uncertainties. Our system comprises an object tracker, an object classifier and an algorithm for reasoning about spatio-temporal continuity. The principle behind the object tracking and classifier modules is to reduce error by increasing ambiguity (by merging objects in close proximity and presenting multiple hypotheses). The reasoning engine resolves error, ambiguity and occlusion to produce a most likely hypothesis, which is consistent with global spatio-temporal continuity constraints. The system results in improved annotation over frame-by-frame methods. It has been implemented and applied to the analysis of a team sports video

Enhanced tracking and recognition of moving objects by reasoning about spatio-temporal continuity.

A framework for the logical and statistical analysis and annotation of dynamic scenes containing occlusion and other uncertainties is presented. This framework consists of three elements; an object tracker module, an object recognition/classification module and a logical consistency, ambiguity and error reasoning engine. The principle behind the object tracker and object recognition modules is to reduce error by increasing ambiguity (by merging objects in close proximity and presenting multiple hypotheses). The reasoning engine deals with error, ambiguity and occlusion in a unified framework to produce a hypothesis that satisfies fundamental constraints on the spatio-temporal continuity of objects. Our algorithm finds a globally consistent model of an extended video sequence that is maximally supported by a voting function based on the output of a statistical classifier. The system results in an annotation that is significantly more accurate than what would be obtained by frame-by-frame evaluation of the classifier output. The framework has been implemented and applied successfully to the analysis of team sports with a single camera. Key words: Visua

High levels of intraspecific genetic divergences revealed for Antarctic springtails: evidence for small-scale isolation during Pleistocene glaciation

We examined levels of genetic variability within and among populations of three Antarctic springtail species (Arthropoda: Collembola) and tested the hypothesis that genetic divergences occur among glacially-isolated habitats. The study was conducted in southern Victoria Land, Ross Dependency, Antarctica, and samples were collected from locations in the vicinity of the Mackay Glacier. We analyzed mtDNA (cytochrome c oxidase subunit I; COI) sequence variability for 97 individuals representing three species (Gomphiocephalus hodgsoni, N = 67; Cryptopygus nivicolus, N = 20; and Antarcticinella monoculata, N = 8). Haplotype diversity and genetic divergences were calculated and used to indicate population variability and also to infer divergence times of isolated populations using molecular clock estimates. Two of the three species showed high levels of genetic divergence. Gomphiocephalus hodgsoni, a widespread and common species, showed 7.6% sequence divergence on opposite sides of the Mackay Glacier. The more range restricted C. nivicolus showed 4.0% divergence among populations. The third species, A. monoculata, was found in only one location. Molecular clock estimates based on sequence divergences suggest that populations separated within the last 4 Mya. We conclude that habitat fragmentation resulting from Pliocene (5 Mya) and Pleistocene (2 Mya to 10 Kya) glaciations has promoted and maintained high levels of diversity among isolated springtail populations on relatively small spatial scales. The region surrounding the Mackay Glacier is likely to have provided refugia for springtail populations during glacial maxima and remains an area of high genetic and species diversity for Collembola within the Ross Sea region

Adiabatic Quantum Computing for Random Satisfiability Problems

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables, the adiabatic method gives solution probabilities close to 1 for problem sizes feasible to evaluate via simulation on current computers. However, for these sizes the minimum energy gaps of most instances are fairly large, so the good performance scaling seen for small problems may not reflect asymptotic behavior where costs are dominated by tiny gaps. Moreover, the resulting search costs are much higher than for other methods. Variants of the quantum algorithm that do not match the adiabatic limit give lower costs, on average, and slower growth than the conventional GSAT heuristic method.Comment: added discussion of discrete adiabatic method, and simulations with 30 bits 8 pages, 8 figure

Trauma, Bereavement and Loss : Key Learning and Messages from Research and Practice

Professionals, and wider society, are becoming increasingly aware of the prevalence of traumatic and adverse childhood experiences, and of the potentially enduring and detrimental impact of such experiences on emotional, psychological and physical health and wellbeing. As a result, there is increased policy and practice attention paid to identifying, understanding and addressing trauma and adversity among individuals. Importantly, this attention is not solely focused on trauma-specialist provision for individuals who are known to have experienced trauma, but also on ensuring that the entire workforce is trauma-informed, as outlined in the Transforming Psychological Trauma framework (NHS Education for Scotland, 2017)

Nested quantum search and NP-complete problems

A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order $\sqrt{d}$, where $d$ is the dimension of the search space, whereas any classical algorithm necessarily scales as $O(d)$. It is shown here that an improved quantum search algorithm can be devised that exploits the structure of a tree search problem by nesting this standard search algorithm. The number of iterations required to find the solution of an average instance of a constraint satisfaction problem scales as $\sqrt{d^\alpha}$, with a constant $\alpha<1$ depending on the nesting depth and the problem considered. When applying a single nesting level to a problem with constraints of size 2 such as the graph coloring problem, this constant $\alpha$ is estimated to be around 0.62 for average instances of maximum difficulty. This corresponds to a square-root speedup over a classical nested search algorithm, of which our presented algorithm is the quantum counterpart.Comment: 18 pages RevTeX, 3 Postscript figure

Investigating Perceptual Congruence Between Data and Display Dimensions in Sonification

The relationships between sounds and their perceived meaning and connotations are complex, making auditory perception an important factor to consider when designing sonification systems. Listeners often have a mental model of how a data variable should sound during sonification and this model is not considered in most data:sound mappings. This can lead to mappings that are difficult to use and can cause confusion. To investigate this issue, we conducted a magnitude estimation experiment to map how roughness, noise and pitch relate to the perceived magnitude of stress, error and danger. These parameters were chosen due to previous findings which suggest perceptual congruency between these auditory sensations and conceptual variables. Results from this experiment show that polarity and scaling preference are dependent on the data:sound mapping. This work provides polarity and scaling values that may be directly utilised by sonification designers to improve auditory displays in areas such as accessible and mobile computing, process-monitoring and biofeedback

Basic concepts in quantum computation

Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarksComment: 37 pages, lectures given at les Houches Summer School on "Coherent Matter Waves", July-August 199

Statistical properties of extragalactic sources in the New Extragalactic WMAP Point Source (NEWPS) catalogue

We present results on spectral index distributions, number counts, redshift distribution and other general statistical properties of extragalactic point sources in the NEWPS5 sample L\'opez-Caniego et al. (2007). The flux calibrations at all the WMAP channels have been reassessed both by comparison with ground based observations and through estimates of the effective beam areas. The two methods yield consistent statistical correction factors. A search of the NED has yielded optical identifications for 89% of sources in the complete sub-sample of 252 sources with S/N>5 and S>1.1 Jy at 23 GHz; 5 sources turned out to be Galactic and were removed. The NED also yielded redshifts for 92% of the extragalactic sources at |b|>10deg. Their distribution was compared with model predictions; the agreement is generally good but a possible discrepancy is noted. Using the 5 GHz fluxes from the GB6 or PMN surveys, we find that 76% of the 191 extragalactic sources with S_23GHz>1.3,Jy can be classified as flat-spectrum sources between 5 and 23 GHz. A spectral steepening is observed at higher frequencies: only 59% of our sources are still flat-spectrum sources between 23 and 61 GHz and the average spectral indexes steepen from = 0.01\pm 0.03 to = 0.37\pm 0.03. We think, however, that the difference may be due to a selection effect. The source number counts have a close to Euclidean slope and are in good agreement with the predictions of the cosmological evolution model by De Zotti et al. (2005). The observed spectral index distributions were exploited to get model-independent extrapolations of counts to higher frequencies. The risks of such operations are discussed and reasons of discrepancies with other recent estimates are clarified.Comment: 8 pages, 4 figures. Accepted for publication in MNRA